Tighter gene tests

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Entropy based genetic association tests and gene-gene interaction tests.

In the past few years, several entropy-based tests have been proposed for testing either single SNP association or gene-gene interaction. These tests are mainly based on Shannon entropy and have higher statistical power when compared to standard χ2 tests. In this paper, we extend some of these tests using a more generalized entropy definition, Rényi entropy, where Shannon entropy is a special c...

متن کامل

Büchi Complementation Made Tighter

The complementation problem for nondeterministic word automata has numerous applications in formal verification. In particular, the language-containment problem, to which many verification problems is reduced, involves complementation. For automata on finite words, which correspond to safety properties, complementation involves determinization. The 2 blow-up that is caused by the subset constru...

متن کامل

Programming with Tighter Control

This paper formalizes continuations as functions abstracting a delimited context instead of an unlimited one. When made available in an expression language such as Scheme, they provide a functional abstraction of control that can be used as any ordinary procedure. This approach sheds light on the applicative aspects of continuations by getting rid of their imperative part: jumping, and makes it...

متن کامل

Buchi Determinization Made Tighter

By separating the principal acceptance mechanism from the concrete acceptance condition of a given Büchi automaton with n states, Schewe presented the construction of an equivalent deterministic Rabin transition automaton with o((1.65n)n) states via history trees, which can be simply translated to a standard Rabin automaton with o((2.26n)n) states. Apart from the inherent simplicity, Schewe’s c...

متن کامل

Tighter PAC-Bayes Bounds

This paper proposes a PAC-Bayes bound to measure the performance of Support Vector Machine (SVM) classifiers. The bound is based on learning a prior over the distribution of classifiers with a part of the training samples. Experimental work shows that this bound is tighter than the original PAC-Bayes, resulting in an enhancement of the predictive capabilities of the PAC-Bayes bound. In addition...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature Biotechnology

سال: 2008

ISSN: 1087-0156,1546-1696

DOI: 10.1038/nbt0708-721c